Proceedings of the 9 th Conference on Uncertainty in Arti cial Intelligence , 259 { 265 , 1993 : Morgan Kaufmann . An Algorithm for the Construction of Bayesian
نویسندگان
چکیده
Previous algorithms for the construction of Bayesian belief network structures from data have been either highly dependent on conditional independence (CI) tests, or have required an ordering on the nodes to be supplied by the user. We present an algorithm that integrates these two approaches-CI tests are used to generate an ordering on the nodes from the database which is then used to recover the underlying Bayesian network structure using a non CI based method. Results of preliminary evaluation of the algorithm on two networks (ALARM and LED) are presented. We also discuss some algorithm performance issues and open problems.
منابع مشابه
Selection in Massively Parallel Genetic Algorithms
The availability of massively parallel computers makes it possible to apply genetic algorithms to large populations and very complex applications. Among these applications are studies of natural evolution in the emerging eld of articial life, which place special demands on the genetic algorithm. In this paper, we characterize the di erence between panmictic and local selection/mating schemes in...
متن کاملLearning Conditional Probabilities from Incomplete Data: An Experimental Comparison
This paper compares three methods | em algorithm, Gibbs sampling, and Bound and Collapse (bc) | to estimate conditional probabilities from incomplete databases in a controlled experiment. Results show a substantial equivalence of the estimates provided by the three methods and a dramatic gain in e ciency using bc. Reprinted from: Proceedings of Uncertainty 99: Seventh International Workshop on ...
متن کاملImportance sampling algorithms for Bayesian networks: Principles and performance
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in the face of extremely unlikely evidence. In addressing this problem, importance sampling algorithms seem to be most successful. We discuss the principles underlying the importance sampling algorithms in Bayesian networks. After that, we describe Evidence Pre-propagation Importance Sampling (EPIS...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملIn : Proceedings of the Tenth Conference on Uncertainty in Arti cial
We present a method for dynamically generating Bayesian networks from knowledge bases consisting of rst-order probability logic sentences. We present a subset of probability logic suucient for representing the class of Bayesian networks with discrete-valued nodes. We impose constraints on the form of the sentences that guarantee that the knowledge base contains all the probabilistic information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993